Axiomatizing Distance Logics
نویسندگان
چکیده
In [8, 6] we introduced a family of ‘modal’ languages intended for talking about distances. These languages are interpreted in ‘distance spaces’ which satisfy some (or all) of the standard axioms of metric spaces. Among other things, we singled out decidable logics of distance spaces and proved expressive completeness results relating classical and modal languages. The aim of this paper is to axiomatize the modal fragments of the semantically defined distance logics of [6] and give a new proof of their decidability.
منابع مشابه
Axiomatizing the lexicographic products of modal logics with linear temporal logic
Given modal logics 1, 2, their lexicographic product 1 ⇤ 2 is a new logic whose frames are the Cartesian products of a 1-frame and a 2-frame, but with the new accessibility relations reminiscent of a lexicographic ordering. This article considers the lexicographic products of several modal logics with linear temporal logic (LTL) based on “next” and “always in the future”. We provide axiomatizat...
متن کاملAxiomatizing Rationality
We provide a sound and complete axiomatization for a class of logics appropriate for reasoning about the rationality of players in games. Essentially the same axiomatization applies to a wide class of decision rules.
متن کاملParaconsistent Modal Logics
We introduce a modal expansion of paraconsistent Nelson logic that is also as a generalization of the Belnapian modal logic recently introduced by Odintsov and Wansing. We prove algebraic completeness theorems for both logics, defining and axiomatizing the corresponding algebraic semantics. We provide a representation for these algebras in terms of twist-structures, generalizing a known result ...
متن کاملModal Logics of Reactive Frames
A reactive graph generalizes the concept of a graph by making it dynamic, in the sense that the arrows coming out from a point depend on how we got there. This idea was first applied to Kripke semantics of modal logic in [2]. In this paper we strengthen that unimodal language by adding a second operator. One operator corresponds to the dynamics relation and the other one relates paths with the ...
متن کاملDynamic Mereotopology II: Axiomatizing some Whiteheadean Type Space-time Logics
In this paper we present an Whiteheadean style point-free theory of space and time. Here ”point-free” means that neither space points, nor time moments are assumed as primitives. The algebraic formulation of the theory, called dynamic contact algebra (DCA), is a Boolean algebra whose elements symbolize dynamic regions changing in time. It has three spatio-temporal relations between dynamic regi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Applied Non-Classical Logics
دوره 12 شماره
صفحات -
تاریخ انتشار 2002